Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
نویسندگان
چکیده
منابع مشابه
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
Avoiding Monochromatic Cycles Fabrice Talla Nobibon HEC-Management School, University of Liège, Rue Louvrex 14, Building N1, B-4000 Liège, Belgium, [email protected] Cor A.J. Hurkens Eindhoven University of Technology, Department of Mathematics and Computer Science. P.O. Box 513, 5600 MB Eindhoven, the Netherlands, [email protected] Roel Leus, Frits C.R. Spieksma University of Leuve...
متن کاملExact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
We consider the problem of deciding whether a given directed graph can be vertex partitioned into two acyclic subgraphs. Applications of this problem include testing rationality of collective consumption behavior, a subject in micro-economics. We prove that the problem is NP-complete even for oriented graphs and argue that the existence of a constant-factor approximation algorithm is unlikely f...
متن کاملTwo-coloring with many monochromatic cliques in both colors
Color the edges of the n-vertex complete graph red and blue, and suppose that red kcliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than ckn , where ck ∈ (0, 1) is the unique root of the equation z = (1 − z) + kz(1 − z)k−1. On the other hand, we construct a coloring in which there are at least ckn k −O(nk−1) red k-cliques and at least the same numbe...
متن کاملPlanar graph coloring avoiding monochromatic subgraphs: trees
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidde...
متن کاملVertex 2-coloring without monochromatic cycles
In this paper we study a problem of vertex two-coloring of undirected graph such that there is no monochromatic cycle of given length. We show that this problem is hard to solve. We give a proof by presenting a reduction from variation of satisfiability (SAT) problem. We show nice properties of coloring cliques with two colors which plays pivotal role in the reduction construction.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2012
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1110.0466